Linear-Time Surface Reconstruction
نویسنده
چکیده
By now it is moderately well understood how to take as input a set of points that lie on an unknown manifold, and produce as output a piecewise linear approximation to the manifold. The question I explore here is: how fast can we do it? Previous solutions achieve a sequential runtime of O(n log n) in low ambient dimensions. I show that if the points are specified in floating point coordinates, we in fact achieve linear work, and we can run in logarithmically many parallel rounds.
منابع مشابه
A Time-Domain Method for Shape Reconstruction of a Target with Known Electrical Properties (RESEARCH NOTE)
This paper uses a method for shape reconstruction of a 2-D homogeneous object with arbitrary geometry and known electrical properties. In this method, the object is illuminated by a Gaussian pulse, modulated with sinusoidal carrier plane wave and the time domains’ footprint signal due to object presence is used for the shape reconstruction. A nonlinear feedback loop is used to minimize the diff...
متن کاملSurface Reconstruction in Almost Linear Time under Locally Uniform Sampling
We describe an implementation of the COCONE algorithm for smooth surface reconstruction which runs in time if the sample is “locally uniform” in addition to being good in the sense required for the Cocone algorithm. If the local uniformity condition does not hold, the algorithm still produces a correct result and its worst case running time is . In contrast, the original Cocone algorithm requir...
متن کاملSurface Reconstruction with Constrained Sculpting Surface Reconstruction with Constrained Sculpting Surface Reconstruction with Constrained Sculpting
The problem of three-dimensional surface reconstruction from a set of unorganized set of points sampled from the surface of an object is important in many applications, such as computer vision, computer-aided design and solid modeling. In recent years several algorithms have been presented for surface reconstruction with provable guarantee on the closeness of the approximation. This thesis pres...
متن کاملLarge Scale Surface Reconstruction based on Point Visibility
The problem of 3D surface reconstruction from calibrated images or laser-scans is well studied in computer vision. There are two main sub-problems that are studied. It is the problem of depth-map computation from images and the problem of depth-maps fusion. In this work, we present several contributions to both sub-problems. First, we present methods that contribute to the sub-problem of depth-...
متن کاملComputer Science and Artificial Intelligence Laboratory Accurate and Scalable Surface Representation and Reconstruction from Images
We introduce a new surface representation, the patchwork, to extend the problem of surface reconstruction from multiple images. A patchwork is the combination of several patches that are built one by one. This design potentially allows the reconstruction of an object of arbitrarily large dimensions while preserving a fine level of detail. We formally demonstrate that this strategy leads to a sp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009